The Goda-teragaito Conjecture: an Overview
نویسنده
چکیده
We give an overview of the proof ([Sc]) that the only knots that are both tunnel number one and genus one are those that are already known: 2-bridge knots obtained by plumbing together two unknotted annuli and the satellite examples classified by Eudave-Muñoz and by Morimoto-Sakuma.
منابع مشابه
Lens space surgeries and a conjecture of Goda and Teragaito
Using work of Ozsváth and Szabó, we show that if a nontrivial knot in S3 admits a lens space surgery with slope p, then p ≤ 4g+3, where g is the genus of the knot. This is a close approximation to a bound conjectured by Goda and Teragaito. AMS Classification numbers Primary: 57M25 Secondary: 57R58
متن کاملUnknotting Tunnels and Seifert Surfaces
Let K be a knot with an unknotting tunnel γ and suppose that K is not a 2-bridge knot. There is an invariant ρ = p/q ∈ Q/2Z, p odd, defined for the pair (K, γ). The invariant ρ has interesting geometric properties: It is often straightforward to calculate; e. g. for K a torus knot and γ an annulus-spanning arc, ρ(K, γ) = 1. Although ρ is defined abstractly, it is naturally revealed when K ∪ γ i...
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001